A Novel Quorum Protocol
نویسندگان
چکیده
One of the traditional mechanisms used in distributed systems for maintaining the consistency of replicated data is voting. A problem involved in voting mechanisms is the size of the Quorums needed on each access to the data. In this paper, we present a novel and efficient distributed algorithm for managing replicated data. We impose a logical wheel structure on the set of copies of an object. The protocol ensures minimum read quorum size of one, by reading one copy of an object while guaranteeing fault-tolerance of write operations.Wheel structure has a wider application area as it can be imposed in a network with any
منابع مشابه
Probabilistic Opaque Quorum Systems
Byzantine-fault-tolerant service protocols like Q/U and FaB Paxos that optimistically order requests can provide increased efficiency and fault scalability. However, these protocols require n ≥ 5b + 1 servers (where b is the maximum number of faults tolerated), owing to their use of opaque Byzantine quorum systems; this is 2b more servers than required by some non-optimistic protocols. In this ...
متن کاملDual-Quorum Replication for Edge Services
This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Dualquorum replication combines volume leases and quorum based techniques in order to achieve excellent availability, response time, and consistency the references to each object (a) tend not to exhibit high concurrency across multiple nodes and (b) tend to exhibit burst...
متن کاملA Novel GPS-Based Quorum Hybrid Routing Algorithm (GPS-QHRA) for Cellular-Based Ad Hoc Wireless Networks
This work presents a novel GPS-based Quorum Hybrid Routing Algorithm (GPS-QHRA), which is a cluster-based approach protocol for cellular-based ad hoc wireless networks. Each node equipped with GPS knows in which zones they are located. Based on the results reported in [12], cellular-based management can achieve better behavior in reducing the number of flooding messages, better bandwidth manage...
متن کاملIncreasing the Resilience of Atomic Commit , at No Additional
This paper presents a new atomic commitment protocol, Enhanced Three Phase Commit (E3PC), that always allows a quorum in the system to make progress. Previously suggested quorum-based protocols (e.g. the quorum-based Three Phase Commit (3PC) Ske82]) allow a quorum to make progress in case of one failure. If failures cascade, however, and the quorum in the system is \lost" (i.e. at a given time ...
متن کاملA New Matching Algorithm for Managing Location Information in Mobile Computing
We describe a fully distributed algorithm for location management. It is based on organizing mobile switching stations into a hierarchical network of grids. The interesting properties of this algorithm are symmetric availability for reads and writes, low quorum size, scalability and flexibility. The algorithm is based on a novel solution for the well-known matching problem that is especially su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1403.5128 شماره
صفحات -
تاریخ انتشار 2014